SHORTEST DISTANCE MAZE SOLVING ROBOT
نویسندگان
چکیده
منابع مشابه
A Mobile Robot Solving a Virtual Maze Environment
The aim of this paper is to introduce a new concept in robot-maze solving, that is, the use of virtual maze in examining the performance and efficiency of various types of robots with various onboard algorithms. It is proposed that a mobile robot is to navigate its way in a virtual environment, which exists in a computer-world and is either gradually or fully revealed to the robot via wireless ...
متن کاملA Potential Maze Solving Algorithm for a Micromouse Robot
L. Wyard-Scott Q.-H. M. Meng y ART (Advanced Robotics & Teleoperation) Lab Department of Electrical Engineering University of Alberta Edmonton, AB, T6G 2G7, CANADA E-mail: [email protected], [email protected] Abstract| Discretely assigned potential levels can be e ectively used in making autonomous route decisions for a mobile robot to reach a goal. This paper demonstrates methods of assi...
متن کاملMental maze solving.
We sought to determine how a visual maze is mentally solved. Human subjects (N = 13) viewed mazes with orthogonal, unbranched paths; each subject solved 200-600 mazes in any specific experiment below. There were four to six openings at the perimeter of the maze, of which four were labeled: one was the entry point and the remainder were potential exits marked by Arabic numerals. Starting at the ...
متن کاملA New Method of Mobile Robot Navigation: Shortest Null Space
In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...
متن کاملA New Method of Mobile Robot Navigation: Shortest Null Space
In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Research in Engineering and Technology
سال: 2016
ISSN: 2321-7308,2319-1163
DOI: 10.15623/ijret.2016.0507038